Surface Parametrization of Nonsimply Connected Planar B\'ezier Regions
نویسندگان
چکیده
A technique is described for constructing three-dimensional vector graphics representations of planar regions bounded by cubic Bézier curves, such as smooth glyphs. It relies on a novel algorithm for compactly partitioning planar Bézier regions into nondegenerate Coons patches. New optimizations are also described for Bézier inside–outside tests and the computation of global bounds of directionally monotonic functions over a Bézier surface (such as its bounding box or optimal field-of-view angle). These algorithms underlie the three-dimensional illustration and typography features of the TEX-aware vector graphics language Asymptote.
منابع مشابه
Surface parameterization of nonsimply connected planar Bézier regions
A technique is described for constructing three-dimensional vector graphics representations of planar regions bounded by cubic Bézier curves, such as smooth glyphs. It relies on a novel algorithm for compactly partitioning planar Bézier regions into nondegenerate Coons patches. New optimizations are also described for Bézier inside–outside tests and the computation of global bounds of direction...
متن کاملA terrain-covering algorithm for an AUV
An eecient, on-line terrain-covering algorithm is presented for a robot (AUV) moving in an unknown three-dimensional underwater environment. Such an algorithm is necessary for producing mosaicked images of the ocean oor. The basis of this three-dimensional motion planning algorithm is a new planar algorithm for nonsimply connected areas with boundaries of arbitrary shape. We show that this algo...
متن کاملOn cohomogeneity one nonsimply connected 7-manifolds of constant positive curvature
In this paper, we give a classification of non simply connected seven dimensional Reimannian manifolds of constant positive curvature which admit irreducible cohomogeneity-one actions. We characterize the acting groups and describe the orbits. The first and second homo-topy groups of the orbits have been presented as well.
متن کاملMan-made Surface Structures from Triangulated Point Clouds
Man-made Surface Structures from Triangulated Point Clouds Photogrammetry aims at reconstructing shape and dimensions of objects captured with cameras, 3D laser scanners or other spatial acquisition systems. While many acquisition techniques deliver triangulated point clouds with millions of vertices within seconds, the interpretation is usually left to the user. Especially when reconstructing ...
متن کاملParameterized Graph Cleaning Problems
We investigate the Induced Subgraph Isomorphism problem with non-standard parametrization, where the parameter is the difference |V (G)| − |V (H)| with H and G being the smaller and the larger input graph, respectively. Intuitively, we can interpret this problem as “cleaning” the graph G, regarded as a pattern containing extra vertices indicating errors, in order to obtain the graph H represent...
متن کامل